-
1 спектральная задача
-
2 спектральная задача
spectral problem мат.Русско-английский научно-технический словарь Масловского > спектральная задача
-
3 проблема собственных значений
1) Automobile industry: eigenproblem2) Makarov: eigen value problem, eigenvalue problem, spectral problemУниверсальный русско-английский словарь > проблема собственных значений
-
4 собственная проблема
Универсальный русско-английский словарь > собственная проблема
-
5 спектральная задача
Mathematics: spectral problemУниверсальный русско-английский словарь > спектральная задача
-
6 обратная спектральная задача
Русско-английский физический словарь > обратная спектральная задача
-
7 сложная проблема
Русско-английский научно-технический словарь переводчика > сложная проблема
-
8 Минимизация на
The problem of minimizing the spectral abscissa over the set $X$Русско-английский словарь по прикладной математике и механике > Минимизация на
-
9 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
См. также в других словарях:
Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… … Wikipedia
Spectral concentration problem — The spectral concentration problem in Fourier analysis refers to finding a time sequence whose discrete Fourier transform is maximally localized on a given frequency interval, as measured by the spectral concentration.pectral concentrationThe… … Wikipedia
Spectral theory of ordinary differential equations — In mathematics, the spectral theory of ordinary differential equations is concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation Hermann Weyl… … Wikipedia
Spectral sequence — In the area of mathematics known as homological algebra, especially in algebraic topology and group cohomology, a spectral sequence is a means of computing homology groups by taking successive approximations. Spectral sequences are a… … Wikipedia
Least-squares spectral analysis — (LSSA) is a method of estimating a frequency spectrum, based on a least squares fit of sinusoids to data samples, similar to Fourier analysis. [cite book | title = Variable Stars As Essential Astrophysical Tools | author = Cafer Ibanoglu |… … Wikipedia
Hamburger moment problem — In mathematics, the Hamburger moment problem, named after Hans Ludwig Hamburger, is formulated as follows: given a sequence { αn : n = 1, 2, 3, ... }, does there exist a positive Borel measure μ on the real line such that:alpha n = int {… … Wikipedia
Elliptic boundary value problem — In mathematics, an elliptic boundary value problem is a special kind of boundary value problem which can be thought of as the stable state of an evolution problem. For example, the Dirichlet problem for the Laplacian gives the eventual… … Wikipedia
Adams spectral sequence — In mathematics, the Adams spectral sequence is a spectral sequence introduced by Adams (1958). Like all spectral sequences, it is a computational tool; it relates homology theory to what is now called stable homotopy theory. It is a… … Wikipedia
100,000-year problem — The 100,000 year problem is a discrepancy between past temperatures and the amount of incoming solar radiation, or insolation, which grows and shrinks periodically on a 100,000 year (100 ka) timescale.Due to variations in the Earth s orbit, the… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Inverse problem — An inverse problem is a general framework that is used to convert observed measurements into information about a physical object or system that we are interested in. For example, if we have measurements of the Earth s gravity field, then we might … Wikipedia